Test Sets for Integer Programs with Z-Convex Objective
نویسنده
چکیده
In this paper we extend test set based augmentation methods for integer linear programs to programs with more general convex objective functions. We show existence and computability of finite test sets for these wider problem classes by providing an explicit relationship to Graver bases. One candidate where this new approach may turn out fruitful is the Quadratic Assignment Problem.
منابع مشابه
Tight formulations for some simple mixed integer programs and convex objective integer programs
We study the polyhedral structure of simple mixed integer sets that generalize the two variable set {(s, z) ∈ IR1+×Z 1 : s ≥ b−z}. These sets form basic building blocks that can be used to derive tight formulations for more complicated mixed integer programs. For four such sets we give a complete description by valid inequalities and/or an integral extended formulation, and we also indicate wha...
متن کاملGraver basis and proximity techniques for block-structured separable convex integer minimization problems
We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N-fold integer programs and two-stage stochastic integer programs with N scenarios. In previous work [R. Hemmecke, M. Köppe, R. Weismantel, A polynomial-time algorithm for optimizing over N-fold 4block decomposable integer programs, Proc. IPCO 2010, Lecture Notes in Computer Science, vol. 6080, Springer, 2...
متن کاملDiscrete Lot–Sizing and Convex Integer Programming
We study the polyhedral structure of variants of the discrete lot–sizing problem viewed as special cases of convex integer programs. Our approach in studying convex integer programs is to develop results for simple mixed integer sets that can be used to model integer convex objective functions. These results allow us to define integral linear programming formulations for the discrete lot–sizing...
متن کاملLattice-free sets, multi-branch split disjunctions, and mixed-integer programming
In this paper we study the relationship between valid inequalities for mixed-integer sets, lattice-free sets associated with these inequalities and the multi-branch split cuts introduced by Li and Richard (2008). By analyzing n-dimensional lattice-free sets, we prove that for every integer n there exists a positive integer t such that every facet-defining inequality of the convex hull of a mixe...
متن کاملMinimal infeasible constraint sets in convex integer programs
In this paper we investigate certain aspects of infeasibility in convex integer programs. In particular we are concerned with the problem of an upper bound for the minimal cardinality of the irreducible infeasible subset of constraints defining feasible region. We prove that for the considered class of convex functions, every infeasible system of inequality constraints in the convex integer pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003